Developing genetic programming techniques for the design of compliant mechanisms
نویسنده
چکیده
Compliant mechanisms achieve desired force and displacement characteristics through elastic deformation of their structure. Current research in the synthesis of compliant mechanism topology has pursued multiobjective optimization using gradient-based search methods. This paper will explore the use of a randomguided search method for multiobjective optimization of compliant mechanisms through genetic programming techniques. The combination of genetic algorithms and compliant mechanisms is an effective and interesting combination of two biologically inspired engineering design areas. This paper will describe and demonstrate the successful use of genetic programming to create a general design tool for topological synthesis of compliant mechanisms. Features that exploit the implementation of genetic algorithms to compliant mechanism design, such as multiple criteria specification, multiple-design parameter variation, and final selections from a family of solutions will be presented and discussed. Finally, the use of this design tool will be demonstrated on several familiar examples for validation and discussion.
منابع مشابه
Large Deflection Analysis of Compliant Beams of Variable Thickness and Non-Homogenous Material under Combined Load and Multiple Boundary Conditions
This paper studies a new approach to analyze the large deflection behavior of prismatic and non-prismatic beams of non-homogenous material under combined load and multiple boundary conditions. The mathematical formulation has been derived which led to a set of six first-order ordinary differential equations. The geometric nonlinearity was solved numerically using the multiple shooting method co...
متن کاملA Novel Experimental Analysis of the Minimum Cost Flow Problem
In the GA approach the parameters that influence its performance include population size, crossover rate and mutation rate. Genetic algorithms are suitable for traversing large search spaces since they can do this relatively fast and because the mutation operator diverts the method away from local optima, which will tend to become more common as the search space increases in size. GA’s are base...
متن کاملDesign of a Mathematical Model for Logistic Network in a Multi-Stage Multi-Product Supply Chain Network and Developing a Metaheuristic Algorithm
Logistic network design is one of the most important strategic decisions in supply chain management that has recently attracted the attention of many researchers. Transportation network design is then one of the most important fields of logistic network. This study is concerned with designing a multi-stage and multi-product logistic network. At first, a mixed integer nonlinear programming model...
متن کاملTMO-Based Programming in COTS Software/Hardware Platforms: A Case Study
Object-oriented analysis and design methodologies have become popular in development of non-real-time business data processing applications. However, conventional object-oriented techniques have had minimal impact on development of real-time applications mainly because these techniques do not explicitly address key characteristics of real-time systems, in particular, timing requirements. The Ti...
متن کاملMathematical Programming Models for Solving Unequal-Sized Facilities Layout Problems - a Generic Search Method
This paper present unequal-sized facilities layout solutions generated by a genetic search program named LADEGA (Layout Design using a Genetic Algorithm). The generalized quadratic assignment problem requiring pre-determined distance and material flow matrices as the input data and the continuous plane model employing a dynamic distance measure and a material flow matrix are discussed. Computa...
متن کامل